In Linear Programming, there are a lot of algorithm or methods to resolve problem. One of the famous one is the Simplex Algorithm. In this article we will see how to resolve a Linear Programming Problem using it. First we will take a look to the algorithm and after we will do an example.
The Algorithm
To understand the algorithm we need to convert our problem into standard form and divide the Matrix A in two (B and D), one for the basic variables and another one for the non basic variables. After that we execute the algothim step.
Example
This is a presentation I made so it will be easy to understand the example.
Let me know if you have some questions.
